Fraction Sets for Basic Digit Sets

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ternary Basic Digit Sets

A radix representation of a real number, for an integral base B ≥ 2 and digit set D, is a string of digits (an...a1a0...)B = ∑∞ i=−n a−iB , with ak ∈ D. It is commonly known that using a digit set of the form {0, 1, ..., B−1}, any positive real number has a B-ary radix representation. This is simply the standardB-ary representation of a number. Alternative digit representations have been of pra...

متن کامل

Admissible digit sets

We examine a special case of admissible representations of the closed interval, namely those which arise via sequences of a finite number of Möbius transformations. We regard certain sets of Möbius transformations as a generalized notion of digits and introduce sufficient conditions that such a “digit set” yields an admissible representation of [0,+∞]. Furthermore we establish the productivity ...

متن کامل

Alternative Digit Sets for Nonadjacent Representations

It is known that every positive integer n can be represented as a finite sum of the form n = P ai2 , where ai ∈ {0, 1,−1} for all i, and no two consecutive ai’s are non-zero. Such sums are called nonadjacent representations. Nonadjacent representations are useful in efficiently implementing elliptic curve arithmetic for cryptographic applications. In this paper, we investigate if other digit se...

متن کامل

Contiguous digit sets and local roundings

We determine for which rouiidings adrlitioii in the floating-point screen has representable rounding error, whicli rouiiclings are implied by truncation of digit strings i n different radix systems with contiguous digits, and how rnany additional digits (including possibly a sticky bit) have to I)c kept in such systems in orcler to perforin a given rorinclirig correctly. Throughout the paper, w...

متن کامل

Analysis of Alternative Digit Sets for Nonadjacent Representations

It is known that every positive integer n can be represented as a finite sum of the form ∑ i ai2 , where ai ∈ {0, 1,−1} and no two consecutive ai’s are non-zero (“nonadjacent form”, NAF). Recently, Muir and Stinson [12, 13] investigated other digit sets of the form {0, 1, x}, such that each integer has a nonadjacent representation (such a number x is called admissible). The present paper contin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Missouri Journal of Mathematical Sciences

سال: 2010

ISSN: 0899-6180

DOI: 10.35834/mjms/1312233138